Research Article Continuous-Time Multiobjective Optimization Problems via Invexity
نویسندگان
چکیده
We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvexity is a necessary and suffcient condition for a vector Karush-Kuhn-Tucker solution to be a weakly efficient solution.
منابع مشابه
Nonsmooth Continuous-Time Multiobjective Optimization Problems with Invexity
A few Karush-Kuhn-Tucker type of sufficient optimality conditions are given in this paper for nonsmooth continuous-time nonlinear multi-objective optimization problems in the Banach space L∞ [0, T ] of all n-dimensional vector-valued Lebesgue measurable functions which are essentially bounded, using Clarke regularity and generalized convexity. Further, we establish duality theorems for Wolfe an...
متن کاملOn efficiency and mixed duality for a new class of nonconvex multiobjective variational control problems
In this paper, we extend the notions of ( , ρ)-invexity and generalized ( , ρ)invexity to the continuous case and we use these concepts to establish sufficient optimality conditions for the considered class of nonconvexmultiobjective variational control problems. Further, multiobjective variational control mixed dual problem is given for the considered multiobjective variational control problem...
متن کاملContinuous-Time Optimization Problems via KT-Invexity
We prove that the notion of KT-invexity for continuous-time nonlinear optimization problem is a necessary and sufficient condition for global optimality of a KarushKuhn-Tucker point.
متن کاملInternational Journal of Operations Research Vol
⎯ The aim of the present work is to characterize weakly efficient solution of multiobjective programming problems under the assumptions of α-invexity, using the concepts of critical point and Kuhn-Tucker stationary point for multiobjective programming problems. In this paper, we also extend the above results to the nondifferentiable multiobjective programming problems. The use of α-invex functi...
متن کاملOptimality criteria for sum of fractional multiobjective optimization problem with generalized invexity
The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development ...
متن کامل